(Non)floating Quantifiers in Japanese

نویسنده

  • Sumiyo Nishiguchi
چکیده

This paper suggests that the continuation-passing style (CPS), a classic technique commonly used in computer science but that has recently been successfully applied to linguistics as in the case of Barker (2002) and others, accounts for different interpretations for floating quantifiers (FQ) and non-floating quantifiers (nonFQ). In a determinerless language such as Japanese, the interpretation changes with the word order, i.e., FQs correspond to indefinites, while nonFQs are considered to be definites in meaning. This paper discusses the semantic function of floating numerals (FN) as indefinite determiners and nonfloating numerals (nonFN) as definite determiners.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantic Properties of (Non-)Floating Quantifiers and their Syntactic Implications1

It is well-known that, in Japanese, classifier phrases (ClPs) (e.g., 3 classifier) or measure phrases (MPs) (e.g., 3 liters) can ‘float’ in that they can be separated from the host noun, as in (1b) and (2b).2 ClPs and MPs in this configuration are referred to as floating quantifiers (FQs), and their non-floated counterparts in (1a) and (2a) in which ClPs or MPs are adjacent to their host noun a...

متن کامل

Anchoring Floating Quantifiers in Japanese-to-English Machine Translation

In this paper we present an algorithm to anchor floating quantifiers in Japanese, a language in which quantificational nouns and numeralclassifier combinations can appear separated from the noun phrase they quantify. The algorithm differentiates degree and event modifiers from nouns that quantify noun phrases. It then finds a suitable anchor for such floating quantifiers. To do this, the algori...

متن کامل

Anchoring Floating Quantifiers in Japanese-to-English Machine Translation

In this paper we present an algorithm to anchor floating quantifiers in Japanese, a language in which quantificational nouns and numeralclassifier combinations can appear separated from the noun phrase they quantify. The algorithm differentiates degree and event modifiers from nouns that quantify noun phrases. It then finds a suitable anchor for such floating quantifiers. To do this, the algori...

متن کامل

Anchoring Floating Quantifiers in Japanese-to-English Machine Transltion

In this paper we present an algorithm to anchor floating quantifiers in Japanese, a language in which quantificational nouns and numeralclassifier combinations can appear separated from the noun phrase they quantify. The algorithm differentiates degree and event modifiers from nouns that quantify noun phrases. It then finds a suitable anchor for such floating quantifiers. To do this, the algori...

متن کامل

Complexity of Presuppositions in Local Domain

In this paper we would like to deal with interaction of presupposition triggers and show that the binding theory of presupposition comes up with it better than the satisfaction theory. In section 2, the newly developed presupposition conception is introduced. Section 3 explains the Binding Theory in contrast with the Satisfaction Theory. In sections 4 and 5, Kamp's new idea about the treatment ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009